Pseudofractal scale-free web
نویسندگان
چکیده
منابع مشابه
Tutte polynomial of pseudofractal scale-free web
The Tutte polynomial of a graph is a 2-variable polynomial which is quite important in both combinatorics and statistical physics. It contains various numerical invariants and polynomial invariants ,such as the number of spanning trees,the number of spanning forests , the number of acyclic orientations , the reliability polynomial,chromatic polynomial and flow polynomial . In this paper,we stud...
متن کاملDomination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
The minimum dominating set (MDS) problem is a fundamental subject of theoretical computer science, and has found vast applications in different areas, including sensor networks, protein interaction networks, and structural controllability. However, the determination of the size of a MDS and the number of all MDSs in a general network is NP-hard, and it thus makes sense to seek particular graphs...
متن کاملIndependence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
As a fundamental subject of theoretical computer science, the maximum independent set (MIS) problem not only is of purely theoretical interest, but also has found wide applications in various fields. However, for a general graph determining the size of a MIS is NP-hard, and exact computation of the number of all MISs is even more difficult. It is thus of significant interest to seek special gra...
متن کاملEvolving pseudofractal networks
We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the networks follow a power-law degree distribution, with degree exponent continuously tuned between 2 and 3. The exact expression of clustering coefficient is also ...
متن کاملWeb Traffic Simulation with Scale-free Network Models
The paper proposes a scale-free model of an Internet and we want to see whether simulation of largesize scale-free networks is possible and if there are limitations in single-CPU simulation. We later simulate the same model using a distributed environment by dividing the task of running the simulation on a number of CPU's running in parallel in a cluster and note the differences in simulation t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2002
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.65.066122